A particular timetable problem: Terminal scheduling
نویسندگان
چکیده
منابع مشابه
Solving Timetable Scheduling Problem by Using Genetic Algorithms
In this paper a genetic algorithm for solving timetable scheduling problem is described. The algorithm was tested on small and large instances of the problem. Algorithm performance was significantly enhanced with modification of basic genetic operators, which restrain the creation of new conflicts in the
متن کاملThe multi-objective railway timetable rescheduling problem
Unexpected disruptions occur for many reasons in railway networks and cause delays, cancellations, and, eventually, passenger inconvenience. This research focuses on the railway timetable rescheduling problem from a macroscopic point of view in case of large disruptions. The originality of our approach is to integrate three objectives to generate a disposition timetable: the passenger satisfact...
متن کاملDecomposing the High School Timetable Problem
The process of timetable construction is a common and repetitive task for High Schools worldwide. In this paper a generic approach is presented for Greek High Schools organized around the idea of solving a significant number of tractable Integer Programming problems. Variables of the underlying mathematical model correspond to daily teacher schedules while a number of hard and soft constraints ...
متن کاملThe Timetable Constrained Distance Minimization Problem
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be minimized. The problem consists of finding an optimal home-away assignment when the opponents of each team in each time slot are given. We present an integer programming, a constraint programming formulation and describ...
متن کاملA Genetic Algorithm to Solve the Timetable Problem
The paper presents an application of an adapted genetic algorithm to a real world instance of the timetable problem. The results of its application are described. We also compare our results with simulated annealing and tabu search. Abstract In this paper we present the results of an investigation of the possibilities offered by genetic algorithms to solve the timetable problem. This problem ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1991
ISSN: 0898-1221
DOI: 10.1016/0898-1221(91)90239-z